Processing of read requests in a memory controller using pre-fetch mechanism

ABSTRACT

A memory controller provided according to an aspect of the present invention includes a predictor block which predicts future read requests after converting the memory address in a prior read request received from the processor to an address space consistent with the implementation of a memory unit. According to another aspect of the present invention, the predicted requests are granted access to a memory unit only when there are no requests pending from processors and the peripherals sending access requests to the memory unit.

BACKGROUND OF THE INVENTION

1. Technical Field

The present disclosure relates to memory controllers, and more specifically to processing of read requests in a memory controller using pre-fetch mechanism.

2. Related Art

A memory controller refers to a component which receives access requests (read requests, write requests, etc.) directed to a memory (e.g., DRAM), and forwards the access requests to the memory. In case of read requests, the memory controller may receive the retrieved data as a response and forwards the retrieved data to components (requesters) from which the read request is received.

In a typical configuration, multiple requesters (such as a central processing unit, graphics controller, external peripherals, etc.) send access requests on a bus and receive corresponding responses also on the bus.

Memory controllers often rely on pre-fetch mechanism in processing read requests. Pre-fetch generally refers to retrieval of data, which is not specifically requested in presently being processed read requests. In general, pre-fetching is performed with a view to immediately providing response to any later received read requests, which request the pre-fetched data.

Thus, a cache is often used to store pre-fetched data and the cache is examined for matching data and if a match is found, the data from the cache is immediately sent to the requester. As a result, responses to such read requests (when match is found) may be provided with reduced delay/latency.

It is generally desirable that such pre-fetch mechanism be supported with one or more of requirements such as reduced latency for at least some types of read requests, avoidance of delay for other requesters, etc.

SUMMARY

A memory controller provided according to an aspect of the present invention includes a predictor block, which predicts future read requests after converting the memory address in a prior read request to an address space consistent with the implementation of a memory unit. In an embodiment, such a feature enables reduction of latency in forming the predicted requests.

According to another aspect of the present invention, the predicted requests are granted access to a memory unit only when there are no requests pending from processors and the peripherals sending access requests to the memory unit. As a result, the non-predicted (actual) read requests (received from processors, peripherals, etc.) may be forwarded to memory unit with less delays.

Several aspects of the invention are described below with reference to examples for illustration. It should be understood that numerous specific details, relationships, and methods are set forth to provide a full understanding of the invention. One skilled in the relevant art, however, will readily recognize that the invention can be practiced without one or more of the specific details, or with other methods, etc. In other instances, well known structures or operations are not shown in detail to avoid obscuring the features of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

Example embodiments of the present invention will be described with reference to the accompanying drawings briefly described below.

FIG. 1 is a block diagram illustrating the details of an example system/device in which several aspects of the present invention can be implemented.

FIG. 2 is a block diagram illustrating the details of a prior memory controller in an embodiment.

FIG. 3 is block diagram illustrating the details of a memory controller in an embodiment of the present invention.

DESCRIPTION OF EXAMPLE EMBODIMENTS

Example Environment

FIG. 1 is a block diagram of an example environment in which several aspects of the present invention can be implemented. The diagram is shown merely for the purpose of illustration, and alternative embodiments may include other blocks and different interconnections between the blocks. System 100 is shown containing central processing unit (CPU) 110, bridge 120, memory unit 130, peripheral controller 140, graphical processing unit (GPU) 150, and peripherals 160A through 160N.

Memory unit 130 represents a memory to which access requests are sent by various requesters (CPU 110, peripheral controller 140 and GPU 150). In general, the access requests need to be sent consistent with an addressing mechanism implemented within memory unit 130. In one embodiment described below in further details, memory unit 130 is implemented as a DIMM (dual-in-line memory module), which requires addresses to be specified in a row-column bank format. For further details of addressing employed in DIMM and other details, the reader is referred to JEDEC DDR3 Specification.

CPU 110 executes instructions stored in memory unit 130 (retrieved via path 112), to implement various user applications and other system software (e.g., drivers, operating system) shared by the user applications. CPU 110 may also store and retrieve data from memory unit 130 while executing such instructions. As relevant to various features of the present invention, CPU 110 sends read requests on bus 112 and receives the corresponding data also on path 112.

GPU 150 generates display signals representing image frames based on various data and commands received from CPU 110. In general, the received data (retrieved via path 152) is processed according to the commands to generate image frames, and display signals are generated corresponding to the image frames. GPU 150 also may send access requests to memory unit 130 via bridge 120 (on path 152). In general, GPU and CPU represent example processor units, which send access requests to memory unit 130.

Peripheral controller 140 provides interface using protocols such as I2C and SATA, to enable multiple lower “intelligence” devices (160A-160N) to interact with other components of system 100. Each peripheral 160A-160N sends access requests through peripheral controller 140 to bridge 120 via path 124. Peripheral controller 140 on receiving the retrieved data in case of read request (on path 124) locates the peripherals, which requested the data and sends the data to the corresponding peripherals.

In an embodiment, peripheral controller 140 corresponds to “South Bridge” and bridge 120 corresponds to “North Bridge”, well known in the relevant arts. Peripherals 160A-160N can be one of SATA (transfer of data between the motherboard and storage devices, such as hard disk drives, inside a computer) or USB (NAND-type flash memory data storage device) compatible devices, audio codec (a hardware device or a computer program that compresses/decompresses digital audio data) or any other device/interface as may be required for the specific environment as is well known in relevant arts.

Bridge 120, provided according to various aspects of the present invention, receives access requests from the various requesters and interfaces with memory unit 130 to ensure that the requests are processed. Accordingly, bridge is deemed to contain a memory controller in accordance with several aspects of the present invention. The requests are received consistent with the interface requirements of respective buses 112/124/152 and implementation of requesters. In addition, the access requests are directed to the memory unit in that the source of the memory request indicates that the access requests are to be forwarded to memory unit 130 by an appropriate convention (and thus, the access requests are said to be directed to memory unit 130).

Various aspects of the present invention enable memory controller to efficiently use pre-fetch mechanism. The features will be clearer in comparison with a prior implementation. Accordingly the description is first continued with respect to a prior implementation.

Example Prior Approach

FIG. 2 illustrates the details of a bridge as relevant to data retrieval/access in a prior approach. The prior embodiment is described in the context of FIG. 1 merely for illustration. Furthermore, in both FIGS. 2 and 3, only the details of the bridge as relevant to memory accesses are included and also each of bidirectional paths 112, 123, 124 and 152 is shown being logically split into two uni-directional paths suffixed with a and b for ease of representation.

The prior bridge is shown containing blocks that are part of the memory controller (shown within the dotted box) and also blocks that may be viewed as being outside of the memory controller. Thus, the memory controller is shown containing predictor block 205, predictor address translator 210, stream address translator 215, processor advance address translator 229, predictor queue 220, processor demand queue 225, processor advance queue 227, write queue 230, read queue 235, DRAM arbiter 245, selection block 250, demux 260, data cache 265, cache controller 270. Stream arbiter 200 and fast sync 202 are viewed as being external to the memory controller.

Path 112 a is used to receive access requests from CPU 110 along with the memory address of the location/position of data (in memory unit 130). Similarly path 124 a is used to receive read/write requests with the corresponding memory addresses from one or more of the peripheral devices such as 160A-160N and path 152 a is used to receive requests with the corresponding memory addresses from GPU 150.

Stream arbiter 200 receives requests (read or write) from the paths 112 a, 124 a and 152 a and forwards each request to the appropriate next component/block. All requests from stream arbiter 200 are forwarded sequentially to stream address translator 215 (after arbitration) on path 201 and CPU read requests are in addition forwarded to cache controller 270 via path 207.

Fast sync 229 receives read requests from path 112 a and forwards it to predictor block 205 and processor advance address translator 229. Fast sync 202 may synchronize the received requests (before forwarding it) as there may be a difference in operating speed between the bus 112 and the memory controller. It may be noted that all the CPU read requests received via path 112 a are sent to the predictor block 205 for predictions and to processor advanced address translator 229 irrespective of when the request is being forwarded by stream arbiter 200 to the memory controller (as a part of arbitration/sequencing).

Processor advance translator 229 translates the memory address (corresponding to the received read request) received via path 203 to a format compatible with the implementation of memory unit 130 and forwards it to processor advance queue 227. It may be noted that processor advance address translator 229 is useful in forwarding the CPU read requests to DRAM 245 immediately upon receipt especially in a scenario when stream arbiter 200 delays forwarding the read request from CPU (while sequencing the requests).

Data cache 265 stores the previously retrieved data elements along with corresponding memory addresses. The entries (data element and address combination) may be removed after some corresponding duration of storage according to one of various approaches (e.g., when not used for a certain number of retrievals or on a FIFO basis) well known in the relevant arts.

Cache controller 270 searches the content of data cache for the data element(s) corresponding to the memory address(es) in each read request received on path 207. If the data element is present in data cache 265 the corresponding response (containing the requested data elements) may be generated based on the content of data cache 265 and sent on path 112 b (corresponding to one of the logically split unidirectional path of 112) to CPU 110.

If the CPU requested data elements are not present in data cache 265, the read request is forwarded to DRAM arbiter 245 either through processor demand queue or processor advance queue as explained below. It may thus be noted that when a first read request is received from CPU 110 (meaning there are no data elements in data cache 265) the request is directly sent to DRAM arbiter 245 through 227.

Predictor block 205 predicts (or speculates) some future requests that may be received from CPU 110 based on previously received requests (via path 203). In general, each prediction causes a read request with corresponding predicted address to be formed. In one prior approach, predictor block 205 uses an algorithm to compute n+1, n+2, n+3, etc. as the addresses in the future requests, wherein n is the memory address in a read request received from CPU 110. In the alternative or addition, the approach further uses logic such as n−1, n−2, n−3, etc., also as the predicted addresses.

Predictor block 205 may probe cache controller 270 to determine whether the response/data of the predicted request is already present in data cache 265. Predictor block 205 sends the predicted memory addresses to predictor address translator 210 only if predicted memory addresses are not present in the data cache 265 (by comparing the predicted addresses with the memory addresses of the data elements present in the data cache using cache controller 270).

Predictor address translator 210 buffers the memory addresses received from predictor block 205 and translates these addresses into RCB addresses or any other type/format depending upon the addressing mechanism implemented within memory unit 130 and forwards the translated address to predictor queue 220.

Stream address translator 215 converts each address from stream arbiter 200 on path 201 into a format compatible with the implementation of memory unit 130. The received request may be originating from CPU, GPU 150 or peripherals 160A-160N. For example assuming that each address received from requesters is in a linear space and that memory unit 130 is implemented as a DIMM (thereby requiring the addresses to be provided in RCB format), each linear address is converted into RCB format. Predicted and processor advanced requests have dedicated address translators 210 and 229 respectively, as shown and translate addresses similar to stream address translator.

As an illustration, it is simplistically assumed that a 36 bit linear address is received from the requesters, and that a memory unit 130 has a 10 bit column address, 13 bit row address and 3 bit bank address (implying there are 8 DRAMs in each bank), and that each column addressing a byte a column address is 8 byte aligned.

Now assuming that the 36 bit linear address equals h000f0f000 in hex format, the column address (10 bits) may equal 200, bank address (3 bits) 111, and row address (13 bits) of 00f0. In general, linear_address[12:3]=column_address, linear_address[15:13]=bank_address and linear_address[28:16]=row_address.

After the translation, address translator 215 places the translated address in the corresponding queue (such as Processor Demand queue, Write Queue, Read Queue) depending up on from where (such as 110, 160A, 160B) the requests originated and the type (read or write) of request, etc., as described below. Predicted addresses from the predictor address translator 210 (after translation) are placed in the predictor queue 220. Processor advance translator 229 translates the CPU read request received via path 203 and places the translated address in the processor advance queue 227.

Queues 220, 225, 227, 230 and 235 respectively buffer the access requests originating due to predicted addresses, read requests from CPU 110 received from stream address translator, read requests from CPU 110 received from processor advance address translator, write requests from all blocks, and read requests from blocks other than the CPU, until dispatched to memory unit 130 via path 123 a. It should be noted that each queue may store the translated address (which is needed for the access requests) and corresponding linear address (at least in case of all the read requests which are to be cached in data cache 265 after retrieval of the data element).

Furthermore each of queues 220,225 and 227 probes cache controller 270 to check whether a response corresponding to a queued entry is already present in cache 265. In a scenario when the requested memory addresses are already present in the data cache then the request is removed from the respective queues (220, 225 or 227). As a result, the same read requests present in both queues 227 and 225 may not be forwarded twice to memory unit 130 via path 123 a.

It is assumed that each queue is implemented as a FIFO (first in first out) queue such that, within a given queue, the first entering access request is available for dispatch next. However, alternative approaches can be used depending on the requirements of the specific sources. Further, each queue is implemented with corresponding hardware support (e.g., physical memory, registers, etc.).

DRAM arbiter 245 determines the specific queue from which an access request can be dispatched on path 123 a, and causes the waiting request from that queue to be dispatched. In an embodiment, arbiter 245 receives request for grants from the queues 220, 225, 227, 230 and 235 as shown by the paths 232A, 232B, 227A, 232C, and 232D respectively when there is a request waiting in the corresponding queues. Path 247 is sent a select value corresponding to the selected queue.

DRAM arbiter 245 uses approaches such as a weighted round robin algorithm for granting access to one of the queue. Round robin implies that the turns are rotated among the queue, while the respective “weight” determines how many more (or fewer) requests are allowed grants from the particular queue, compared to the other queues on the list.

Thus, assuming that it is desirable to serve the requests from CPU 110 more, queue 225 and 227 may be assigned more weight compared to other queues. Accordingly requests from the CPU 110 in processor demand queue 225 or processor advance queue 227 are granted access to the path 123 a by the arbiter more times than that of the requests from the other queues (such as Write Queue 230).

In one prior implementation, in each access cycle, a combined weight is given to the combination of predictor queue 220, processor demand queue 225 and processor advance queue 227. Thus, three groups are deemed to be present in the weighted round robin allocation, with the first group having queues 220, 225 and 227, the second group having queue 230 and the third group having queue 235. Each group is provided a turn consistent with the weight assigned to the group. The first group is assigned more turns based on a larger weight assigned to the group.

Within the first group, arbiter 245 implements a fixed priority, with queues 225, 227 and 220 being provided a correspondingly lower priority in that order. Thus, arbiter 245 provides grant to the processor advance queue and predictor queue only when there are no requests pending in processor demand queue 225. Similarly, queue 227 is provided a turn when there are no requests pending in queue 225.

Thus, it may be observed that requests from predictor queue 220 may be sent when there may be actual requests waiting in other queues such as 230 and 235 thereby delaying the serving of actual requests from the peripherals (such as 160A-160N) and GPU 150. It may also be noted that this might happen more often as the “weight” given to the CPU is often more (to ensure the read requests from CPU are served fast) than that of the peripherals and GPU.

Selection block 250 selects the next pending access request from the specific one of queues 220/225/230/235/227 according to the specific selection value received on path 247, and sends the selected request to memory unit 130 on path 123 a. Selection block 250 may cause the transmitted request to be removed from the corresponding queue.

Demux 260 receives selection data indicating which of the queues 220/225/230/227 and 235 has been granted access to bus 123 a in each access cycle and uses the selection data to channel the retrieved data in case of read request to the corresponding destinations. For example, if a received data element is in response to a request from predictor queue 220, the data element is stored in data cache along with the corresponding memory addresses as received from demux 260.

If a received data element is in response to a request from processor demand queue 225 or processor advance queue 227, the data element is stored in data cache 265 and sent on path 112 b (corresponding to one of the logically split uni-directional path of 112) to CPU 110. If a received data element is in response to a request from one of peripherals, the data element is sent on path 124 b (corresponding to one of the logically split uni-directional path of 124). If a received data element is in response to a request from GPU 150, the data element is sent on path 152 b (corresponding to one of the logically split uni-directional path of 152)

It may be appreciated that data retrieved from memory unit 130 is one full cache line (based on the memory address received) even if the CPU request specifies the size of the data (which may be less than one cache line). Similarly the data sent (each transmission) via path 112 b will be half a cache line per interface clock. As many interface clocks as required to send the requested data are used. It may also be noted that one cache line is generally 64 bytes.

Demux 260 further provides the linear address along with the retrieved data element to cache controller 270, in case of read requests (either predicted or from the CPU). The linear address is received from the respective queue 220/225/227 via DRAM arbiter 245.

It may be observed that the approach of FIG. 2 has several drawbacks. For example, as noted above, processing of the actual requests received from the peripherals and GPU may be delayed due to the predicted requests, even if the predicted requests may not be useful later.

In addition, predictions performed prior to translation may cause further latency in processing the read requests.

Several aspects of present invention overcome at least some of the limitations described above. While the features of the invention are described with respect to addressing the limitations of FIG. 2, it should be appreciated that the invention can be implemented in various alternative embodiments, as will be apparent to one skilled in the relevant arts by reading the disclosure provided herein.

Novel Memory Controller

FIG. 3 illustrates the details of a memory controller provided according to an aspect of the present invention. As the memory controller is contained in bridge 120, the portions external to the memory controller are shown outside of the dotted line, as in FIG. 2. In addition, components of FIG. 3 with similar/same name as in FIG. 2 perform similar/same function/operation as described above, and the differences are described below for conciseness. Thus, stream arbiter 300, data cache 365, cache controller 370, and demux 360 may operate similar to stream arbiter 200, data cache 265, cache controller 270 and demux 260 and the description is not repeated substantially for conciseness.

Fast sync 302 forwards the read requests from CPU 110 (received via path 112 a) to processor advance address translator 329 (via path 303) instead of forwarding it to both predictor block and processor advance address translator as shown above in the prior approach.

Processor advance address translator 329 translates each memory address received via path 303 to a format consistent with the implementation of memory unit 130. Thus, the addresses may be translated into RCB format in case of DIMM memories, as described above with an example. Processor advance translator 329 after translation (of received addresses) forwards the translated addresses to predictor block 305 (for predictions) and to the processor advance queue 327 for buffering (for later processing). Thus predictions are performed on the translated addresses as per the new approach.

Stream address translator 315 translates each received address (from stream arbiter), and each translated access/read request is stored in corresponding one of queues 325,330 and 335 (which operate respectively similar to 225, 230 and 235) depending on the request being processed and from where the request originated.

Predictor block 305 predicts (or speculates) read requests that may be received from CPU 110 in future based on the translated address. The predicted requests thus formed are sent to predictor queue 320. The prediction can again be implemented using various approaches as will be apparent to one skilled in the relevant arts.

In one embodiment, the address corresponding to the predicted read request is determined by adding 1 to the column part of the Row Column Bank (RCB) translated address. When the increment exceeds the number of rows available (implying that the next address corresponds to a next bank), the predicted address is ignored and thus not sent to predictor queue 320.

For example, for a 36 bit linear address of 36′h000f0f000 described above with respect to Prior Art embodiments, predictor block 305 may add 1 to the column address and form a value of 201 for the column address, while keeping the row address and bank address to be the same.

Due to the simplicity of the prediction approach, the prediction can be performed quickly, thereby potentially facilitating the performance of prediction and translation in a single clock cycle.

Predictor block 305 may further support providing of the linear addresses to data cache 365. In an embodiment, predictor block 305 generates the linear address corresponding to the predicted RCB address (e.g., by adding 1 to the received linear address) and provides the linear address along with the predicted address (for the predicted read requests) to predictor queue 320.

As described below, the various blocks operate to provide access requests from processors and peripherals according to the respective assigned weights or priorities, while sending the predicted requests only if no other requests are available in the respective queues.

DRAM arbiter 345 receives request for grants from queues 325, 327, 330 and 335 when there is a request waiting in the corresponding queues, and provides a grant to one of the requesting queues. It should be appreciated that receiving the grant requests represents an example approach to examining the status of the queues, though other techniques can be employed to check the status of the queues.

The specific queue to which a grant is provided can be based on various approaches. For example, a fixed priority based approach can be used, where a queue with a lower priority is provided a grant only if there are no waiting entries in a higher priority queue. In an alternative embodiment, arbiter 345 uses a weighted round robin approach (described above with respect to prior art embodiments) in determining the queue to which the grant is to be provided. For the weighted round robin purpose, the first group includes queues 325 and 327, the second group contains queue 330, and the third queue contains queue 335. Within the first group, queue 325 is given a higher priority over queue 327, as also described with respect to the prior approach above. It should be noted that predictor queue 320 is not considered in the weighted round robin approach.

Selection block 350 receives an identifier of the selected queue from arbiter and selects the access request from the corresponding selected queue. The selected access request is provided on path 358 to the interface block 390. Inverter 380 generates on path 388 one logic level (e.g., 0) when arbiter 345 has not selected any of the queues (to provide grant) and another logic level otherwise.

Interface block 390 selects the access request from either path 358 or path 334A depending on the value on path 388. The selected access request is sent to memory unit 130 on path 391/123 a. At least to the extent of selection, the interface block and the inverter may be viewed as being part of arbiter 345.

Thus, the predicted requests are sent only when no requests are present from any of the processors or peripherals, thereby reducing the delays in processing requests from at least the peripherals. Furthermore, due to the simplicity of prediction approach, time critical path may be avoided in pre-fetching data elements.

Reference throughout this specification to “one embodiment”, “an embodiment”, or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases “in one embodiment”, “in an embodiment” and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.

While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of the present invention should not be limited by any of the above described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Further, the purpose of the following Abstract is to enable the U.S. Patent and Trademark Office and the public generally, and especially the scientists, engineers and practitioners in the art who are not familiar with patent or legal terms or phraseology, to determine quickly from a cursory inspection the nature and essence of the technical disclosure of the application. The Abstract is not intended to be limiting as to the scope of the present invention in any way. 

What is claimed is:
 1. A method of controlling accesses to a memory unit, said method operable to be performed in a memory controller, said method comprising: receiving a first set of read requests from a processor unit and a first plurality of requests from a plurality of peripheral devices; forming a set of predicted requests based on said first set of read requests; queuing said first set of read requests in a first queue and said first plurality of requests in a second queue; selecting one of said set of predicted requests, said first set of read requests and said first plurality of requests as a selected request; and sending said selected request to said memory unit in an access cycle, wherein one of said set of predicted requests is selected as said selected request only if there are no requests in said first queue and said second queue in said access cycle.
 2. The method of claim 1, further wherein said queuing stores said set of predicted requests in a third queue, wherein said selecting comprises checking a status of said first queue and said second queue for absence of pending requests in said first queue and said second queue.
 3. The method of claim 1, wherein each of said first set of read requests is received in a first address space and data in said memory unit is stored according to a second address space, said method further comprising: translating an address of each of said first set of read requests from said first address space to said second address space, wherein said forming is performed in said second address space after performing said translating.
 4. The method of claim 3, wherein said second address space comprises a column identifier, a row identifier, and a bank identifier for each address, wherein said forming comprises incrementing the column identifier of the translated addresses of the first set of read requests to produce an incremented column identifier; and wherein said forming ignores a corresponding predicted request if the incremented column identifier is more than a number of columns present in a corresponding bank.
 5. The method of claim 3, further comprising: storing in a cache the data units received in response to sending said set of predicted requests; examining said cache in response to receiving each of said first set of read requests; and if a data unit is present for a request, sending a response to said processor unit based on the data units stored in said cache.
 6. The method of claim 3, wherein said first address space is a linear address space, and said second address space is a row-column bank space.
 7. A memory controller operable to process read requests from a processor, said read requests being directed to a memory unit, said memory controller comprising: an address translator operable to receive a first set of read requests in a first address space from said processor, wherein said address translator is operable to translate an address of each of said first set of read requests from said first address space to a second address space of said memory unit; a predictor block operable to examine said first set of read requests in said second address space and operable to form a set of predicted requests based on said first set of read requests in said second address space; and an interface block operable to send said first set of read requests and said set of predicted requests in said second address space to said memory unit.
 8. The memory controller of claim 7, further comprises: a first queue operable to store said first set of read requests with addresses in said second space; a second queue operable to store said set of predicted requests; a third queue operable to store a second set of requests from a plurality of peripherals; and an arbiter operable to select a pending request in one of said first queue, said second queue and said third queue in an access cycle, wherein said arbiter is operable to select the pending request from said second queue only if there are no requests in said first queue and said third queue in said access cycle.
 9. The memory controller of claim 8, wherein said second address space comprises a plurality of column identifiers and a plurality of row identifiers, wherein said predictor block is operable to increment said plurality of column identifier of the said second address space to form said set of predicted requests.
 10. The memory controller of claim 9, wherein said first address space is a linear address space, and said second address space is a row-column bank space.
 11. The memory controller of claim 9, wherein said predictor block ignores the corresponding predicted request if the incremented column identifier is more than a number of columns present in the corresponding bank.
 12. The memory controller of claim 11, wherein said predictor block generates a linear address for said corresponding predicted request and stores said linear address of the corresponding predicted request also in said second queue.
 13. The memory controller of claim 9, wherein said arbiter is operable to use a weighted round robin approach in selecting one of said first queue and said third queue, said memory controller further comprises: a first selection block operable to receive an identifier from said arbiter, said identifier identifying the selected one of said first queue and said third queue, and operable to forward on a first path a first pending request from the queue identified by said identifier; said interface block operable to select a request received on said first path or a first pending request in said second queue, and wherein said interface block selecting said first pending request in said second queue when said identifier indicates that neither of said first queue and said second queue is selected by said arbiter, and wherein said interface block sending the selected request to said memory unit.
 14. A system comprising: a memory unit operable to store a plurality of data elements according to a second address space; a processor operable to generate a first set of read requests directed to said memory unit according to a first address space; a memory controller operable to control access to said memory unit, said memory controller comprising: an address translator operable to receive said first set of read requests in said first address space, wherein said address translator is operable to translate an address of each of said first set of read requests from said first address space to said second address space; a predictor block operable to examine said first set of read requests in said second address space and operable to form a set of predicted requests based on said first set of read requests in said second address space; and an interface block operable to send said first set of read requests and said set of predicted requests in said second address space to said memory unit.
 15. The system of claim 14, further comprising a component operable to generate a second plurality of read requests also directed to said memory unit, wherein said memory controller further comprises: a first queue operable to store said first set of read requests with addresses in said second space; a second queue operable to store said set of predicted requests; a third queue operable to store said second set of read requests; and an arbiter operable to select a pending read request in one of said first queue, said second queue and said third queue in an access cycle, wherein said arbiter is operable to select the pending request from said second queue only if there are no requests in said first queue and said third queue in said access cycle.
 16. The system of claim 15, wherein said component is a peripheral, said system further comprising: a first bus coupling said processor to said memory controller; a peripheral controller operable to interface with said peripheral; and a second bus coupling said peripheral controller to said memory controller.
 17. The system of claim 16, wherein said memory unit is implemented as a duel in-line memory modules (DIMM), and wherein said first address space is a linear address space and said second address space is a row-column bank space, and wherein said second address space comprises a plurality of column identifiers and a plurality of row identifiers corresponding to columns and rows contained in said DIMM, and wherein said predictor block is operable to increment said plurality of column identifier of the said second address space to form said set of predicted requests.
 18. The system of claim 17, wherein said predictor block ignores a corresponding predicted request if the incremented column identifier is more than a number of columns present in the corresponding bank.
 19. The system of claim 18, wherein said arbiter is operable to use a weighted round robin approach in selecting one of said first queue and said third queue, said memory controller further comprises: a first selection block operable to receive an identifier from said arbiter, said identifier identifying a selected one of said first queue and said third queue, and operable to forward on a first path a first pending request from the queue identified by said identifier; said interface block operable to select a request received on said first path or a first pending request in said second queue, and wherein said interface block selecting said first pending request in said second queue when said identifier indicates that neither of said first queue and said second queue is selected by said arbiter, and wherein said interface block sending the selected request to said memory unit.
 20. The system of claim 19, wherein said first queue is operable to store requests received on said first bus only and said second queue is operable to receive requests received on said second bus only.
 21. The system of claim 19, wherein said address translator is operable to translate said address of each of the first set of read requests to said second address space prior to said predictor block forming said set of predicted request based on the first set of read requests in said second address space. 